GLU3.0: Fast GPU-based Parallel Sparse LU Factorization for Circuit Simulation
نویسندگان
چکیده
منابع مشابه
GPU-Accelerated Parallel Sparse LU Factorization Method for Fast Circuit Analysis
Lower upper (LU) factorization for sparse matrices is the most important computing step for circuit simulation problems. However, parallelizing LU factorization on the graphic processing units (GPUs) turns out to be a difficult problem due to intrinsic data dependence and irregular memory access, which diminish GPU computing power. In this paper, we propose a new sparse LU solver on GPUs for ci...
متن کاملParallel LU Factorization on GPU Cluster
This paper describes our progress in developing software for performing parallel LU factorization of a large dense matrix on a GPU cluster. Three approaches, with increasing software complexity, are considered: (i) a naive “thunking” approach that links the existing parallel ScaLAPACK software library with cuBLAS through a software emulation layer; (ii) a more intrusive magmaBLAS implementation...
متن کاملParallel Symbolic Factorization for Sparse LU Factorization with Static Pivoting
In this paper we consider a direct method to solve a sparse unsymmetric system of linear equations Ax = b, which is the Gaussian elimination. This elimination consists in explicitly factoring the matrix A into the product of L and U , where L is a unit lower triangular matrix, and U is an upper triangular matrix, followed by solving LUx = b one factor at a time. One of the main characteristics ...
متن کاملUnsymmetric-pattern Multifrontal Methods for Parallel Sparse Lu Factorization
Sparse matrix factorization algorithms are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method replace irregular operations with dense matrix kernels. However, no e cient method based primarily on dense matrix kernels exists for matrices whose pattern is very u...
متن کاملParallel Symbolic Factorization for Sparse LU with Static Pivoting
This paper presents the design and implementation of a memory scalable parallel symbolic factorization algorithm for general sparse unsymmetric matrices. Our parallel algorithm uses a graph partitioning approach, applied to the graph of |A|+ |A| , to partition the matrix in such a way that is good for sparsity preservation as well as for parallel factorization. The partitioning yields a so-call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Design & Test
سال: 2020
ISSN: 2168-2356,2168-2364
DOI: 10.1109/mdat.2020.2974910